Random Strict Partitions and Determinantal Point Processes
نویسندگان
چکیده
منابع مشابه
Random Strict Partitions and Determinantal Point Pro- Cesses
We present new examples of determinantal point processes with infinitely many particles. The particles live on the half-lattice {1,2, . . . } or on the open half-line (0,+∞). The main result is the computation of the correlation kernels. They have integrable form and are expressed through the Euler gamma function (the lattice case) and the classical Whittaker functions (the continuous case). Ou...
متن کاملDeterminantal point processes and random matrix theory in a nutshell
3 Universality 5 3.1 Macroscopic behaviour . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 3.1.1 Wigner’s semicircle law . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 3.2 Microscopic behaviour . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 3.2.1 Bulk universality . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ...
متن کاملRandom Walks on Strict Partitions
We consider a certain sequence of random walks. The state space of the nth random walk is the set of all strict partitions of n (that is, partitions without equal parts). We prove that, as n goes to infinity, these random walks converge to a continuous-time Markov process. The state space of this process is the infinite-dimensional simplex consisting of all nonincreasing infinite sequences of n...
متن کاملMarkov Determinantal Point Processes
A determinantal point process (DPP) is a random process useful for modeling the combinatorial problem of subset selection. In particular, DPPs encourage a random subset Y to contain a diverse set of items selected from a base set Y . For example, we might use a DPP to display a set of news headlines that are relevant to a user’s interests while covering a variety of topics. Suppose, however, th...
متن کاملStructured Determinantal Point Processes
We present a novel probabilistic model for distributions over sets of structures— for example, sets of sequences, trees, or graphs. The critical characteristic of our model is a preference for diversity: sets containing dissimilar structures are more likely. Our model is a marriage of structured probabilistic models, like Markov random fields and context free grammars, with determinantal point ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Communications in Probability
سال: 2010
ISSN: 1083-589X
DOI: 10.1214/ecp.v15-1542